Parameterized Cache Coherence Protocol Verification using Invariant
نویسندگان
چکیده
Verification of parameterized cache coherence protocol is very important in the share-memory multiprocessor system. In this paper, a new method was proposed to verify the correctness of parameterized cache coherence protocol based on the invariant. Firstly, we present the parameterized cache coherence protocol as semi-algebraic transition system, and then solve the invariant of transition system based on inductive assertion map. Finally, verify the correctness of parameterized cache coherence protocol by checking whether the invariant satisfies the specification of parameterized cache coherence protocol or not.
منابع مشابه
Counterexample Guided Invariant Discovery for Parameterized Cache Coherence Verification
We propose a heuristic-based method for discovering inductive invariants in the parameterized verification of safety properties. The promise of the method stems from powerful heuristics we have identified for verifying the cache coherence of directory based protocols. The heuristics are based on syntactic analysis of counterexamples generated during verification, combined with simple static ana...
متن کاملParaVerifier: An Automatic Framework for Proving Parameterized Cache Coherence Protocols
Parameterized verification of cache coherence protocols is an important but challenging research problem. We present in this paper our automatic framework paraVerifier to handle this problem: (1) it first discovers auxiliary invariants and the corresponding causal relations between invariants and protocol rules from a small reference instance of the verified protocol; (2) the discovered invaria...
متن کاملParameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system based on symbolic model checking. The proof process is described step by step. The protocol model is derived from an earlier proof of the FLASH protocol, using the PVS system, allowing a direct comparison between the tw...
متن کاملFinite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol
In [5, 6] we proposed a simple but powerful approach to the verification of safety properties of parameterized and infinite state systems. Consider encoding e : s 7→ φs of states of a transition system S = 〈S,→〉 by formulae of first-order predicate logic satisfying the folowing property. The state s is reachable from s, i.e. s → s if and only if φs′ is the logical consequence of φs, that is φs ...
متن کاملRapid Parameterized Model Checking of Snoopy Cache Coherence Protocols
A new method is proposed for parameterized reasoning about snoopy cache coherence protocols. The method is distinctive for being exact (sound and complete), fully automatic (algorithmic), and tractably efficient. The states of most cache coherence protocols can be organized into a hierarchy reflecting how tightly a memory block in a given cache state is bound to the processor. A broad framework...
متن کامل